Modal Logics Between Propositional and First-order
نویسنده
چکیده
One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if terms are allowed to be non-rigid, a scoping mechanism (usually written using lambda abstraction) must also be introduced to avoid ambiguity. Since quantifiers are not present, this is not really a first-order logic, but it is not exactly propositional either. For propositional logics such as K, T and D, adding such machinery produces a decidable logic, but adding it to S5 produces an undecidable one. Further, if an equality symbol is in the language, and interpreted by the equality relation, logics from K4 to S5 yield undecidable versions. (Thus transitivity is the villain here.) The proof of undecidability consists in showing that classical first-order logic can be embedded.
منابع مشابه
The Axioms of Team Logic
A framework is developed that extends calculi for propositional, modal and predicate logics to calculi for team-based logics. This method is applied to classical and quantified propositional logic, first-order logic and the modal logic K. Complete axiomatizations for propositional team logic PTL, quantified propositional team logic QPTL, modal team logic MTL and the dependence-atom-free fragmen...
متن کاملCoalescing: Syntactic Abstraction for Reasoning in First-Order Modal Logics
We present a syntactic abstraction method to reason about first-order modal logics by using theorem provers for standard first-order logic and for propositional modal logic.
متن کاملModal reasoning as simulation
Enabling reasoning as simulations with concrete objects and relations has a merit of grounding reasoning to more basic perceptual mechanisms. In a hybrid artificial intelligence architecture that uses both logical and non-logical computational methods, the use of simulations for enabling logical inferences allows one to alternate between the logical method and a non-logical one that uses, for e...
متن کاملModal Theorem Proving
We describe resolution proof systems for several modal logics. First we present the propo-sitional versions of the systems and prove their completeness. The first-order resolution rule for classical logic is then modified to handle quantifiers directly. This new resolution rule enables us to extend our propositional systems to complete first-order systems. The systems for the different modal lo...
متن کاملAlgorithmic Correspondence and Canonicity for Possibility Semantics (Abstract)
Unified Correspondence. Correspondence and completeness theory have a long history in modal logic, and they are referred to as the “three pillars of wisdom supporting the edifice of modal logic” [22, page 331] together with duality theory. Dating back to [20,21], the Sahlqvist theorem gives a syntactic definition of a class of modal formulas, the Sahlqvist class, each member of which defines an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Log. Comput.
دوره 12 شماره
صفحات -
تاریخ انتشار 2002